Network routing using indirect next hop data

ABSTRACT

A router maintains routing information including (i) route data representing destinations within a computer network, (ii) next hop data representing interfaces to neighboring network devices, and (iii) indirect next hop data that maps a subset of the routes represented by the route data to a common one of the next hop data elements. In this manner, routing information is structured such that routes having the same next hop use indirect next hop data structures to reference common next hop data. In particular, in response to a change in network topology, the router need not change all of the affected routes, but only the common next hop data referenced by the intermediate data structures. This provides for increased efficiency in updating routing information after a change in network topology, such as link failure.

This application is a Continuation of U.S. application Ser. No.12/847,735, filed Jul. 30, 2010, which is a Continuation of U.S.application Ser. No. 10/045,717, filed Oct. 19, 2001, the entirecontents of each of which are incorporated herein by reference.

TECHNICAL FIELD

The invention relates to computer networks and, more particularly, totechniques for routing packets within computer networks.

BACKGROUND

A computer network is a collection of interconnected computing devicesthat can exchange data and share resources. In a packet-based network,such as the Internet, the computing devices communicate data by dividingthe data into small blocks called packets, which are individually routedacross the network from a source device to a destination device. Thedestination device extracts the data from the packets and assembles thedata into its original form. Dividing the data into packets enables thesource device to resend only those individual packets that may be lostduring transmission.

Certain devices, referred to as routers, maintain routing informationthat describes routes through the network. A “route” can generally bedefined as a path between two locations on the network. Upon receivingan incoming packet, the router examines information within the packet toidentify the destination for the packet. Based on the destination, therouter forwards the packet in accordance with the routing information.

Conventional routers often maintain the routing information in the formof one or more routing tables. The form and contents of the routingtables often depends on the routing algorithm implemented by the router.Common routing algorithms include distance vector routing algorithms andpath vector routing algorithms. Many of these algorithms make use of theconcept of a “hop,” which refers to a connection between two devices.Consequently, the distance between two devices is often measured inhops. Furthermore, in reference to routing a packet, the “next hop” froma network router typically refers to a neighboring device along a givenroute.

The physical connection between two devices on a network is generallyreferred to as a link. Many conventional computer networks, includingthe Internet, are designed to dynamically reroute data packets in theevent of a topology change, such as a link failure. Upon a topologychange, the routers transmit new connectivity information to neighboringdevices, allowing each device to update its local routing information.Links can fail for any number of reasons, such as failure of thephysical infrastructure between the devices, or failure of the devicesinterfacing with the link. The size and complexity of routinginformation maintained by routers within large networks can besignificant. As a result, updating the routing information due tochanges in network topology can consume considerable computing resourcesand substantially delay rerouting of packets.

SUMMARY

In general, the invention provides for increased efficiency in updatingrouting information after a change in network topology, such as linkfailure. According to the principles of the invention, a routermaintains routing information that makes use of indirect references toidentify the appropriate next hop for each route. In other words,intermediate data structures are introduced, referred to herein asindirect next hop data, between the routing information and the next hopinformation. The routing information is structured such that routeshaving the same next hop use indirect next hop data structures to pointto common next hop data.

The invention offers many advantages, including reducing the impact andlatency of network topology changes by reducing the computer resourcesrequired to update the routing information. In particular, in responseto a change in network topology, the router need not change all of theaffected routes, only the common next hop data referenced by theintermediate data structures. The router can, for example, overwrite thecommon next hop data with new next hop data. In this fashion, the routercan effectively update a large number of routes, and thereby dynamicallyreroute packets, with minimal changes to the routing information.

In one embodiment, the invention is directed to a method includingrouting packets within a network using indirect next hop data thatassociates a plurality of routes with a common portion of next hop data.

In another embodiment, the invention is directed to a method includingstoring route data representing routes within a computer network, andstoring next hop data representing network devices that neighbor anetwork router. The method further includes storing indirect next hopdata that maps at least a subset of the routes represented by the routedata to a common portion of the next hop data. The route data may bestored as a radix tree, and the indirect next hop data may be stored asdata pointers within leaf nodes of the radix tree.

In another embodiment, the invention is directed to a router comprisinga routing engine to store routing information representing a topology ofa network. The router further comprises a packet forwarding engine tostore packet forwarding information in accordance with the routinginformation, the packet forwarding information including (i) route datarepresenting destinations within a computer network, (ii) next hop datarepresenting interfaces to neighboring network devices, and (iii)indirect next hop data that maps a subset of the routes represented bythe route data to a common portion of the next hop data.

In another embodiment, the invention is directed to a router comprisinga computer-readable medium to store: (i) route data representing routeswithin a computer network, (ii) next hop data representing neighboringnetwork devices, and (iii) indirect next hop data that maps at least asubset of route data to a common portion of the next hop data.

In another embodiment, the invention is directed to a computer-readablemedium containing data structures. The data structures include a firstdata structure to store route data representing destinations within acomputer network, a second data structure to store next hop datarepresenting interfaces to neighboring network devices, and a set ofindirect next hop data that map at least a subset of the route data to acommon portion of the next hop data.

The details of one or more embodiments of the invention are set forth inthe accompanying drawings and the description below. Other features,objects, and advantages of the invention will be apparent from thedescription and drawings, and from the claims.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating an example router configuredconsistent with the principles of the invention.

FIG. 2A is a block diagram illustrating data structures for oneexemplary arrangement of routing information making use of indirect nexthop data.

FIG. 2B is a block diagram illustrating data structures for anotherexemplary arrangement of routing information making use of indirect nexthop data.

FIG. 3 is a block diagram illustrating an example data structure forresolving next hop data to interface ports or other next hop actions.

FIG. 4 is a block diagram illustrating another example router configuredconsistent with the principles of the invention.

FIG. 5 is a flow chart illustrating an example operation of a routermaking use of indirect next hop data.

DETAILED DESCRIPTION

FIG. 1 is a block diagram illustrating an example router 4 configuredconsistent with the principles of the invention. In the exemplaryembodiment illustrated in FIG. 1, router 4 includes one or moreinterface cards (IFCs) 6 for sending and receiving packets using networklinks 12 and 13. IFCs 6 are typically coupled to network links 12, 13via a number of interface ports. In general, router 4 receives inboundpackets from network links 12, determines destinations for the receivedpackets, and outputs the packets on network links 13 based on thedestinations.

Router 4 includes a routing engine 8 that maintains routing information10, which describes a topology of a network and, in particular, theroutes through the network. Routing information 10 may include, forexample, route data 14 that describes various routes within the network,and corresponding next hop data 18 indicating appropriate neighboringdevices within the network for each of the routes.

Routing information 10 may associate each next hop with one of networklinks 13 or IFCs 6. In particular, upon receiving an inbound packet,routing engine 8 determines a route within route data 14 for the inboundpacket, and examines next hop data 18 of routing information 10 toidentify a next hop for the packet. Based on the identified next hop,routing engine 8 determines an interface port associated with the nexthop, and forwards the inbound packet to the appropriate IFC 6 fortransmission. The architecture of router 4 illustrated in FIG. 1 is forexemplary purposes only. The invention is not limited to thisarchitecture. In other embodiments, router 4 may be configured in avariety of ways. In one embodiment, for example, routing engine 8 andits corresponding functionality may be replicated and incorporateddirectly within IFCs 6.

According to the principles of the invention, routing information 10 maymake use of indirect references to associate routes with correspondingnext hops. In other words, routing information 10 may use intermediatedata structures, referred to herein as indirect next hop data 16, thatmaps route data 14 to next hop data 18. In particular, indirect next hopdata 16 is structured such that routes that make use of the same nexthop from router 4 reference a common portion of next hop data 18. Inthis manner, router 4 need not maintain separate next hop data for eachindividual route. In addition, routing information 10 may maintainreferences that bypass indirect next hop data 16, and associate routedata 14 directly with next hop data 18.

In response to a change in network topology, routing engine 8 candynamically reroute packets for multiple routes by changing a commonportion of next hop data 18. More specifically, because routes using thesame next hops share a common portion of next hop data 18, routingengine 8 can update next hop data 18 without needing to update routedata 14, which can be significantly large for some networks. In thisfashion, routing engine 8 can update large number of routes, and therebyquickly reroute packets, with minimal changes to the routing information10.

FIG. 2A is a block diagram illustrating example data structures for onearrangement of routing information 10. In the illustrated embodiment,route data 14 of routing information 10 is arranged as a radix tree 19that maps network routes to indirect next hop data 16 and next hop data18. More specifically, radix tree 19 includes a number of leaf nodes22A, 22B, 22C, 22D, collectively referred to as leaf nodes 22. Each ofleaf nodes 22 corresponds to a network route. For large networks, radixtree 19 can become sizable and may easily include over 300,000 leafnodes 22. Consequently, for exemplary purposes, FIG. 2 depicts a portionof radix tree 19. The arrangement of routing information 10 as a radixtree is illustrated for exemplary purposes. The principles of inventionmay readily be applied to other arrangements. Routing information 10 maybe arranged, for example, as a number of tables, link lists, and otherdata structures that store pointers to indirect next hop data 16 andnext hop data 18.

Upon receiving an inbound packet, routing engine 8 reads a block of datacorresponding to the packet, referred to as the “key,” that includes anetwork destination. The key may, for example, contain a routing prefixfor another router within the network. Routing engine 8 resolves the keyto one of leaf nodes 22 by traversing radix tree 19. In particular,routing engine 8 traverses radix tree 19 by sequentially testing bits A,B and C, which represent any bits within the key. Based on the value ofeach bit A, B, C, routing engine 8 follows the links of radix tree 19through the various levels until reaching one of leaf nodes 22.

Leaf nodes 22A, 22B and 22C include indirect next hop data 16 thatreferences an array 24 storing next hop data 18. In particular, theindirect next hop data 16 points to one of the elements of array 24,thereby identifying a corresponding next hop for a respective networkdestination. In this manner, leaf nodes 22A, 22B and 22C of radix tree19 do not contain next hop information, but include references to nexthop data 18 that is stored in a separate data structure. In thisfashion, indirect next hop data 16 provides intermediate data structuresthat relate route data 14 to next hop data 18. Leaf node 22D stores,however, stores next hop data NH12, and thereby bypasses indirect nexthop data 16. In an alternative embodiment, array 24 may store referencesto specific interface ports, processing modules, or both.

Upon resolving a key of an inbound packet to one of leaf nodes 22A, 22Band 22C, routing engine 8 uses the contained one of indirect next hopdata 16 to read next hop data from the referenced element of array 24.In the illustrated example, routing engine 8 resolves a packet key of“010” to leaf node 22C. Routing engine 8 uses the pointer containedwithin indirect hop data structure 22C to access the fourth element ofarray 24, i.e., the element with an index equal to 3, thereby resolvingthe key to next hop data NH2. Upon resolving the destination to a nexthop, routing engine 8 determines an interface port associated with theactual next hop NH2, and forwards the inbound packet to the appropriateIFC 6 for transmission.

As illustrated in FIG. 2A, network routes corresponding to leaf nodes22A, 22B, 22C share a common next hop. In other words, router 4 forwardsall packets destined for these routes to the same neighboring networknode, i.e., the same next hop. Consequently, according to the principlesof the invention, the indirect next hop data 16 within leaf nodes 22A,22B, 22C reference a common portion of next hop data, i.e., element 3 ofarray 24. If a network event occurs that requires rerouting packetsalong these routes, such as failure of the link between router 4 and theneighboring device, routing engine 8 can dynamically reroute the packetsby modifying array 24. In particular, routing engine 8 can overwrite thenext hop data NH2 of element 3 with new next hop data. In response to anetwork event, routing engine 8 may, for example, write NH12 to element3 of array 24, thereby quickly rerouting packets destined for NH2 to analternate next hop, i.e., NH12.

In this manner, separating route data 14 from next hop data 18 byindirect next hop data 16 provides many advantages. Routing engine 8,for example, need not update radix tree 19 and, in particular, each ofleaf nodes 22A, 22B and 22C. In large networks, it is not uncommon for50,000 or more network destinations to have the same next hop from arouting device. By making use of intermediate references between radixtree 19 and the next hop data stored within array 18, instead ofincorporating the next hop data within the radix tree 19, routing engine8 need not change all of the affected leaf nodes 22, only the commonnext hop data. In this fashion, router 4 can dynamically reroute packetswith minimal changes to the routing information 10.

FIG. 2B is a block diagram illustrating a second exemplary arrangementof routing information 10. In the illustrated embodiment, route data 14of routing information 10 is arranged as a radix tree 40 that mapsnetwork routes to indirect next hop data 16 and next hop data 18. Radixtree 40 includes a number of leaf nodes 32A, 32B, 32C, 32D, collectivelyreferred to as leaf nodes 32.

As illustrated in FIG. 2B, indirect next hop data 16 of leaf nodes 32may include multiple references to array 34 storing next hop data 18.Leaf nodes 32A and 32B, for example, include primary (P) references andbackup (B) references to portions of next hop data 18. For exemplarypurposes, the primary references of leaf nodes 32A and 32B reference acommon portion of next hop data, i.e., element 3 of array 24. The backupreferences of leaf nodes 32A and 32B reference a common backup next hop,as identified within element 0 of array 24. In this manner, indirectnext hop data 16 for nodes 32A, 32B indicates that next hop NH5 is to beused in the event next hop NH2 fails. Leaf node 32C includes a singleprimary reference that identifies a portion of next hop data 18.

To generate radix tree 40, routing engine 8 precomputes alternative nexthop and adds the alternative next hops to array 34. Based on thealternative next hops, routing engine 8 may include primary and backupreferences within leaf nodes 32 of radix tree 40, and may mark thesereferences as active or inactive based on the current network topology.

This arrangement may provide a number of advantages when a networkevent, such as failure of a network link, requires router 4 to reroutepackets. In particular, routing engine 8 can quickly reroute the packetsfrom a primary next hop to a backup next hop without regenerating radixtree 40. For routes making use of a failed next hop, routing engine 8may promote any backup references within corresponding leaf nodes 32 toprimary references, and may mark the existing primary references asinactive. In this manner, routing engine 8 can quickly reroute packetsto a precomputed backup next hop with minimal changes to routinginformation 10.

When an inactive next hop becomes available, routing engine 8 identifiesthose leaf nodes 32 referencing the next hop and marks the references asactive. Routing engine 8 may promote the newly activated next hop to aprimary next hop, or may designate the next hop as a backup next hop.

FIG. 3 is a block diagram illustrating an example data structure 70 forresolving next hop data 18 to interface ports. In the illustratedembodiment, data structure 70 forms a two-dimensional array having Nrows and 3 columns. Each row uniquely associates a next hop with aninterface port. Row 0, for example, associates next hop data NH10 withinterface port IFC10. Although as illustrated each row maps a next hopto an interface port, data structure 70 could be used to map a next hopto any type of processing module. A row may, for example, map a packetto one of a number of network protocol modules, such as TCP/IP or MPLS,executing on the router for processing. In addition, a row may list zeroor more other processing modules including, for example, a packetfiltering module, a packet counting module, a policy enforcement module,and a rate-limiting module.

FIG. 4 is a block diagram illustrating another example router 74configured consistent with the principles of the invention. Router 74includes control unit 78 that directs inbound packets received frominbound link 12 to the appropriate outbound link 13. In particular, thefunctionality of control unit 78 is divided between a routing engine 85and a packet forwarding engine 80.

Routing engine 85 is primarily responsible for maintaining routinginformation 86 to reflect the current network topology. In particular,routing engine 85 periodically updates routing information 86 toaccurately reflect the network topology.

In accordance with routing information 86, packet forwarding engine 85maintains forwarding information 84 that associates network destinationswith specific next hops and corresponding interface ports of IFCs 6.Forwarding information 84 may, therefore, be thought of as a subset ofthe information contained within routing information 86. Upon receivingan inbound packet, forwarding engine 84 directs the inbound packet to anappropriate IFCs 6 for transmission based on forwarding information 84.In one embodiment, each of packet forwarding engine 80 and routingengine 85 may comprise one or more dedicated processors, hardware, andthe like, and may be communicatively coupled by data communicationchannel 82. Data communication channel 82 may be a high-speed networkconnection, bus, shared-memory or other data communication mechanism.

When a network event occurs, such as a link failure, routing engine 85updates routing information 86 and directs packet forwarding engine 80to update forwarding information 84. Routing engine 85 may, for example,communicate one or more messages over data communication channel 82directing packet forwarding engine 80 to update the next hop data forone or more network destinations.

Forwarding engine 80, routing engine 85, or both, may make use of thedata structures and organization described above. In particular, packetforwarding engine 80 may maintain forwarding information 84 so as tomake use of indirect next hop data. The indirect next hop data mayassociate, for example, leaf nodes of a forwarding tree with next hopdata. This embodiment may be advantageous in that, in response to anupdate message from routing engine 85, packet forwarding engine 80 mayneed only update next hop data that is referenced by the indirect nexthop data structures, and not the forwarding tree itself

In addition, routine engine 85 may organize routing information 86 toinclude a local copy 90 of forwarding information 84, or portionsthereof. This embodiment may be particularly advantageous in reducingthe number of messages between routing engine 85 and packet forwardingengine 80. Upon updating routing information 86 due to a change ofnetwork topology, routing engine 85 may identify the next hop data to bechanged by examining the copy of forwarding information 90. Based on theexamination, routing engine 85 may generate a limited number of messagesdirecting forwarding engine 85 to appropriately update next hop datawithin forwarding information 84. In particular, routing engine 85 maygenerate a single message directing packet forwarding engine 80 tooverwrite a common next hop datum referenced by indirect next hop datastructures within leaf nodes of a forwarding tree. This may greatlyreduce the number of messages between routing engine 85 and packetforwarding engine 80, primarily because the number of messages is nolonger a function of the number of routes affected by the change, aswith conventional routers.

FIG. 5 is a flow chart illustrating an example operation of routingengine 85 consistent with the principles of the invention. Uponreceiving new network information from another network node (94),routing engine 85 updates routing information 86. Router 4 may receive,for example, network information via the Border Gateway Protocol (BGP)or other protocol for sharing network information.

After updating routing information 86, routing engine 85 examines alocal copy of forwarding information 90 to determine whether packets canbe dynamically rerouted by changing next hop data (98). Based on theexamination, routing engine 85 may generate one or more update messagesdirecting packet forwarding engine 80 to appropriately update next hopdata within forwarding information 84 (100). Routing engine 85communicates the messages to packet forwarding engine 80 to update nexthop data as referenced by indirect next hop data structures within leafnodes of a forwarding tree within forwarding information 84. Asdescribed above, packet forwarding engine 80 may dynamically reroutepackets by modifying a common portion of the next hop data, such as anelement of an array. Forwarding engine 80 may, for example, write newnext hop to one or more elements of the array, thereby quickly reroutingpackets to an alternate next hop. In this manner, packet forwardingengine 80 may not need to change the forwarding tree itself, which maygreatly reduce the number of messages between routing engine 85 andforwarding engine 80.

Furthermore, packet forwarding engine 80 may promote backup next hopreferences within corresponding leaf nodes of the forwarding tree toprimary next hop references, and may mark existing primary next hopreferences as inactive. In this manner, packet forwarding engine 80 mayquickly reroute packets to a precomputed backup next hop.

Various embodiments of the invention have been described that providefor increased efficiency in updating routing information after a changein network topology, such as link failure. These and other embodimentsare within the scope of the following claims.

1. A method comprising: storing, within a network device, a forwardingtree that includes a set of hierarchically arranged nodes, wherein theset of nodes includes a root node, a plurality of intermediate nodes,and a plurality of leaf nodes, wherein the leaf nodes store datapointers to data structures that are external to the forwarding tree,wherein the data structures store next hop data, and wherein at leasttwo of the leaf nodes each include a corresponding data pointer thatpoints to a same one of the data structures that is external to theforwarding tree; receiving a network update packet at the networkdevice, wherein the network update packet comprises network updateinformation; and updating network routes for future packets by modifyingthe next hop data in the data structures that are external to theforwarding tree without modifying the forwarding tree, wherein modifyingthe next hop data includes changing a specific next hop identified bythe same data pointer that is included in the at least two of the leafnodes so as to alter routes defined by the at least two of the leafnodes of the forwarding tree without altering data stored within theleaf nodes.
 2. The method of claim 1, further comprising: receiving, atthe network device, a packet to be routed through a network; identifyinga key within the packet, wherein the key includes a set of bits thatidentify a network destination for the packet; and traversing theforwarding tree within the network device, wherein traversing theforwarding tree includes testing the set of bits of the key with respectto different nodes of the set of nodes to traverse a path from the rootnode though the intermediate nodes to a particular one of the leaf nodesof the forwarding tree, wherein values of the tested bits in the keydetermine the path that is traversed through the forwarding tree toreach the particular one of the leaf nodes of the forwarding tree. 3.The method of claim 2, further comprising: upon traversing theforwarding tree and reaching the particular leaf node of the forwardingtree, using a respective data pointer stored within the particular leafnode to identify a respective one of the data structures that isexternal to the forwarding tree, wherein the data structures that areexternal to the forwarding tree store next hop data and the respectiveone of the data structures defines a particular next hop for the packet,the particular next hop being associated with a particular networkdevice coupled to the network device via a network link; and forwardingthe packet to a particular interface port of the network device that iscoupled to the network link so as to forward the packet to theparticular next hop defined by the respective one of the data structuresthat is external to the forwarding tree.
 4. The method of claim 1,wherein the forwarding tree comprises a radix tree.
 5. The method ofclaim 1, further comprising: storing, within each of the leaf nodes, afirst data pointer to the data structures that are external to theforwarding tree, wherein the first pointer defines a primary next hop;and storing, within each of the leaf nodes, a second data pointer to thedata structures that are external to the forwarding tree, wherein thesecond data pointer defines a backup next hop.
 6. The method of claim 5,further comprising routing packets to the backup next hop for at leastone of the leaf nodes in response to a network event.
 7. The method ofclaim 5, further comprising: initially routing packets to the primarynext hop for at least one of the leaf nodes; and in response to anetwork event, re-routing the packets to the backup next hop for the atleast one of the leaf nodes.
 8. The method of claim 1, furthercomprising: storing routing information within a routing engine of thenetwork device; generating the forwarding tree and the data structuresthat are external to the forwarding tree based on the routinginformation; and storing the forwarding tree and the data structuresthat are external to the forwarding tree within a packet forwardingengine associated with the network device.
 9. The method of claim 8,further comprising: updating the network routes for the future packetsby modifying the next hop data in the data structures in response toreceiving updates of the routing information in the routing engine. 10.The method of claim 8, further comprising: updating the forwarding treeand modifying the next hop data in the data structures in response toreceiving the updates of the routing information.
 11. The method ofclaim 8, further comprising storing a copy of the routing information inthe routing engine and the packet forwarding engine.
 12. A networkdevice comprising: a routing component that stores a forwarding treethat includes a set of hierarchically arranged nodes, wherein the set ofnodes includes a root node, a plurality of intermediate nodes, and aplurality of leaf nodes, wherein the leaf nodes store data pointers todata structures that are external to the forwarding tree, wherein thedata structures store next hop data, and wherein at least two of theleaf nodes each include a corresponding data pointer that points to asame one of the data structures that is external to the forwarding tree;and one or more inbound ports that receive a network update packet atthe network device, wherein the network update packet comprises networkupdate information, wherein in response to receiving the network updatepacket, the routing component updates network routes for future packetsby modifying the next hop data in the data structures that are externalto the forwarding tree without modifying the forwarding tree, whereinmodifying the next hop data includes changing a specific next hopidentified by the same data pointer that is included in the at least twoof the leaf nodes so as to alter routes defined by the at least two ofthe leaf nodes of the forwarding tree without altering data storedwithin the leaf nodes.
 13. The network device of claim 12, wherein theone or more inbound ports receive a packet to be routed through anetwork, and wherein the routing component: identifies a key within thepacket, wherein the key includes a set of bits that identify a networkdestination for the packet; traverses the forwarding tree within thenetwork device, wherein traversing the forwarding tree includes testingthe set of bits of the key with respect to different nodes of the set ofnodes to traverse a path from the root node though the intermediatenodes to a particular one of the leaf nodes of the forwarding tree,wherein values of the tested bits in the key determine the path that istraversed through the forwarding tree to reach the particular one of theleaf nodes of the forwarding tree.
 14. The network device of claim 12,wherein, upon traversing the forwarding tree and reaching the particularleaf node of the forwarding tree, the routing component uses arespective data pointer stored within the particular leaf node toidentify a respective one of the data structures that is external to theforwarding tree, wherein the data structures that are external to theforwarding tree store next hop data and the respective one of the datastructures defines a particular next hop for the packet, the particularnext hop being associated with a particular network device coupled tothe network device via a network link, and wherein the routing componentforwards the packet to a particular interface port of the network devicethat is coupled to the network link so as to forward the packet to theparticular next hop defined by the respective one of the data structuresthat is external to the forwarding tree.
 15. The network device of claim12, wherein the forwarding tree comprises a radix tree.
 16. The networkdevice of claim 12, wherein the routing component: stores, within eachof the leaf nodes, a first data pointer to the data structures that areexternal to the forwarding tree, wherein the first pointer defines aprimary next hop; and stores, within each of the leaf nodes, a seconddata pointer to the data structures that are external to the forwardingtree, wherein the second data pointer defines a backup next hop.
 17. Thenetwork device of claim 12, wherein the routing component: initiallyroutes packets to the primary next hop for at least one of the leafnodes; and in response to a network event, re-routes the packets to thebackup next hop for the at least one of the leaf nodes.
 18. The networkdevice of claim 12, further comprising: a packet forwarding engine,wherein the routing component generates the forwarding tree and the datastructures that are external to the forwarding tree based on the routinginformation, and stores the forwarding tree and the data structures thatare external to the forwarding tree in the packet forwarding engine,wherein the routing component updates the network routes for the futurepackets by modifying the next hop data in the data structures of thepacket forwarding engine in response to receiving updates of the routinginformation in the routing component.
 19. The network device of claim18, wherein the routing component: updates the forwarding tree andmodifies the next hop data in the data structures in response toreceiving the updates of the routing information.
 20. A non-transitorycomputer-readable medium comprising executable instructions that uponexecution in a network device, cause the network device to: store,within a network device, a forwarding tree that includes a set ofhierarchically arranged nodes, wherein the set of nodes includes a rootnode, a plurality of intermediate nodes, and a plurality of leaf nodes,wherein the leaf nodes store data pointers to data structures that areexternal to the forwarding tree, wherein the data structures store nexthop data, and wherein at least two of the leaf nodes each include acorresponding data pointer that points to a same one of the datastructures that is external to the forwarding tree; receive a networkupdate packet at the network device, wherein the network update packetcomprises network update information; and update network routes forfuture packets by modifying the next hop data in the data structuresthat are external to the forwarding tree without modifying theforwarding tree, wherein modifying the next hop data includes changing aspecific next hop identified by the same data pointer that is includedin the at least two of the leaf nodes so as to alter routes defined bythe at least two of the leaf nodes of the forwarding tree withoutaltering data stored within the leaf nodes.